Kleinberg navigation in fractal small-world networks.
نویسندگان
چکیده
We study the Kleinberg problem of navigation in small-world networks when the underlying lattice is a fractal consisting of N>>1 nodes. Our extensive numerical simulations confirm the prediction that the most efficient navigation is attained when the length r of long-range links is taken from the distribution P(r) approximately r(-alpha), where alpha=d(f) is the fractal dimension of the underlying lattice. We find finite-size corrections to the exponent alpha, proportional to 1/(ln N)2.
منابع مشابه
Lévy Walk Navigation in Complex Networks: A Distinct Relation between Optimal Transport Exponent and Network Dimension.
We investigate, for the first time, navigation on networks with a Lévy walk strategy such that the step probability scales as pij ~ dij(-α), where dij is the Manhattan distance between nodes i and j, and α is the transport exponent. We find that the optimal transport exponent α(opt) of such a diffusion process is determined by the fractal dimension df of the underlying network. Specially, we th...
متن کاملResearch Letter Kleinberg Navigation on Anisotropic Lattices
We study the Kleinberg problem of navigation in small-world networks when the underlying lattice is stretched along a preferred direction. Extensive simulations confirm that maximally efficient navigation is attained when the length r of long-range links is taken from the distribution P(r)∼r−α, when the exponent α is equal to 2, the dimension of the underlying lattice, regardless of the amount ...
متن کاملPossible origin of efficient navigation in small worlds.
The small-world phenomenon is one of the most important properties found in social networks. It includes both short path lengths and efficient navigation between two individuals. It is found by Kleinberg that navigation is efficient only if the probability density distribution of an individual to have a friend at distance r scales as P(r) ∼ r(-1). Although this spatial scaling is found in many ...
متن کاملThe evolution of navigable small-world networks
Small-world networks, which combine randomized and structured elements, are seen as prevalent in nature. Several random graph models have been given for small-world networks, with one of the most fruitful, introduced by Jon Kleinberg [10], showing in which type of graphs it is possible to route, or navigate, between vertices with very little knowledge of the graph itself. Kleinberg’s model is s...
متن کاملThe Evolution of Small-World Networks
Small-world networks, which combine randomized and structured elements, are seen as prevalent in nature. Several random graph models have been given for small-world networks, with one of the most fruitful, introduced by Jon Kleinberg [12], showing in which type of graphs it is possible to route, or navigate, between vertices with very little knowledge of the graph itself. Kleinberg’s model is s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Physical review. E, Statistical, nonlinear, and soft matter physics
دوره 74 1 Pt 2 شماره
صفحات -
تاریخ انتشار 2006